PRISM

Benchmark
Model:csma v.1 (MDP)
Parameter(s)N = 4, K = 2
Property:time_max (exp-reward)
Invocation (default)
./fix-syntax ./prism -javamaxmem 11g -cuddmaxmem 4g -ii -heuristic speed -e 1e-6 -ddextraactionvars 100 -maxiters 1000000 csma.4-2.prism csma.props --property time_max
Execution
Walltime:58.00962686538696s
Return code:0
Relative Error:4.5515613265457076e-07
Log
PRISM
=====

Version: 4.5.dev
Date: Sat Mar 14 17:03:27 UTC 2020
Hostname: e72bdd194fc5
Memory limits: cudd=4g, java(heap)=11g
Command line: prism -javamaxmem 11g -cuddmaxmem 4g -ii -heuristic speed -e 1e-6 -ddextraactionvars 100 -maxiters 1000000 csma.4-2.prism csma.props --property time_max

Parsing model file "csma.4-2.prism"...

Type:        MDP
Modules:     bus station1 station2 station3 station4 
Variables:   b y1 y2 s1 x1 bc1 cd1 s2 x2 bc2 cd2 s3 x3 bc3 cd3 s4 x4 bc4 cd4 

Parsing properties file "csma.props"...

5 properties:
(1) "all_before_max": Pmax=? [ !"collision_max_backoff" U "all_delivered" ]
(2) "all_before_min": Pmin=? [ !"collision_max_backoff" U "all_delivered" ]
(3) "some_before": Pmin=? [ F min_backoff_after_success<K ]
(4) "time_max": R{"time"}max=? [ F "all_delivered" ]
(5) "time_min": R{"time"}min=? [ F "all_delivered" ]

---------------------------------------------------------------------

Model checking: "time_max": R{"time"}max=? [ F "all_delivered" ]

Warning: Switching to sparse engine and (backwards) Gauss Seidel (default for heuristic=speed).

Building model...

Computing reachable states...

Reachability (BFS): 193 iterations in 2.17 seconds (average 0.011244, setup 0.00)

Time for model construction: 2.268 seconds.

Type:        MDP
States:      761962 (1 initial)
Transitions: 1327068
Choices:     825504

Transition matrix: 52233 nodes (4 terminal), 1327068 minterms, vars: 54r/54c/17nd

Prob0E: 204 iterations in 3.26 seconds (average 0.015971, setup 0.00)

Prob1A: 1 iterations in 0.01 seconds (average 0.011000, setup 0.00)

goal = 9, inf = 0, maybe = 761953
Time for computing an upper bound for expected reward: 30.338 seconds.
Upper bound for max expectation (variant 2): 465891.3109526639

Computing remaining rewards...
Engine: Sparse

Building sparse matrix (transitions)... [n=761962, nc=825495, nnz=1327059, k=4] [21.2 MB]
Building sparse matrix (transition rewards)... [n=761962, nc=825495, nnz=456769, k=4] [11.3 MB]
Creating vector for state rewards... [5.8 MB]
Creating vector for inf... [5.8 MB]
Creating vector for lower bounds... [5.8 MB]
Creating vector for upper bounds... [5.8 MB]
Allocating iteration vectors... [4 x 5.8 MB]
TOTAL: [79.0 MB]

Starting iterations (interval iteration)...
Iteration 143: max relative diff=0.999855, 5.03 sec so far
Iteration 287: max relative diff=0.994911, 10.04 sec so far
Iteration 432: max relative diff=0.009829, 15.07 sec so far
Max relative diff between upper and lower bound on convergence: 9.32765E-07
Iterative method: 565 iterations in 21.43 seconds (average 0.034825, setup 1.76)
Maximum finite value in solution vector at end of interval iteration: 148.30524919803696

Value in the initial state: 142.21223382622642

Time for model checking: 54.969 seconds.

Result: 142.21223382622642 (value in the initial state)


Overall running time: 57.818 seconds.

---------------------------------------------------------------------

Note: There was 1 warning during computation.